A distributed token based h-out of-k Mutual Exclusion protocol for mobile ad hoc networks

In this paper, we describe a new token based h-out of-k mutual exclusion protocol for mobile ad hoc networks. This protocol does neither use the routing layer nor a logical structure and agrees requests based on their distances away to the token, their olds, and there resources number. A request is sent on the routes of the nodes for which a request is present in the local queue, with a dynamical radius (typically 25%) computed, so to reach a part of them. Simulation results show that the radius tends to the value 1.2 for medium and high request loads. Freed resources follow in footsteps of the token. The protocol traits many characteristics of mobile ad hoc networks: nodes’ movements create of links, partitioning and merger of the network. Fail of links and nodes and token and resources’ loss may also happen. The protocol manages one token with k resources in each partition and regenerates them in case of lost. Duplication of token and resources are avoided while partition’s merger. Simulation provides satisfactorily results in its entirety; the number of messages is rather low especially for medium and heavy loads.